Analyticity and Logicality in Semantic Constraints
نویسندگان
چکیده
Logic is often said to be “formal” in some sense. This is generally taken to mean that logical inferences, and therefore valid logical arguments, are those where the conclusion follows based on the form of the constituent sentences alone. Catarina Dutilh Novaes (2011) and John MacFarlane (2000) cite this notion as one of the ways we can think about the formality of logic. More specifically, this notion of formality is often taken to mean that logic is formal because it abstracts from the particular attributes and identities of the objects involved in the arguments. This is intuitive to most people who have taken an introductory logic class; logically valid arguments do not depend on facts about the objects referred to by the terms in the argument. This is in fact the position taken by many philosophers of logic (Sher (1991, 2008), Tarski (1986), and MacFarlane (2000)). Gil Sagi (2014) refers to this principle as one of the tenets of formality; I will refer to this principle throughout as F1.
منابع مشابه
Semantic Constraint and QoS-Aware Large-Scale Web Service Composition
Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...
متن کاملLogicality of Conditional Rewrite Systems
A conditional term rewriting system is called logical if it has the same logical strength as the underlying conditional equational system. In this paper we summarize known logicality results and we present new sufficient conditions for logicality of the important class of oriented conditional term rewriting systems.
متن کاملA Note on Generalized Functional Completeness in the Realm of Elementary Logic
In “Logicality and Invariance” (2008), Denis Bonnay introduced a generalized notion of functional completeness. In this note we call attention to an alternative characterization that is both natural and elementary. 1. Maximizing the expressive power of a logic Let L be a logic whose logical vocabulary contains truth-functional connectives (possibly infinitary ones), the first-order quantifiers ...
متن کاملNew analyticity constraints on the high energy behavior of hadron-hadron cross sections
We here comment on a series of recent papers by Igi and Ishida[K. Igi and M. Ishida, Phys. Lett B 622, 286 (2005)] and Block and Halzen[M. M. Block and F. Halzen, Phys. Rev D 72, 036006 (2005)] that fit high energy pp and p̄p cross section and ρ-value data, where ρ is the ratio of the real to the imaginary portion of the forward scattering amplitude. These authors used Finite Energy Sum Rules an...
متن کاملLogical Operations and Invariance
I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so called Tarski-Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017